منابع مشابه
Notes on NP Completeness
Here are some notes which I wrote to try to understand what NP completeness means. Most of these notes are taken from Appendix B in Douglas West’s graph theory book, and also from wikipedia. There’s nothing remotely original about these notes. I just wanted all this material to filter through my brain and onto paper. I also wanted to collect everything together in a way I like. Here’s what thes...
متن کاملLinear Logic, Totality and Full Completeness
I give a ‘totality space’ model for linear logic [4], derived by taking an abstract view of computations on a datatype. The model has similarities with both the coherence space model and game-theoretic models [1, 5], but is based upon a notion of total object. Using this model, I prove a full completeness result, along the lines of the results for game theoretic models in [1] and [5]. In other ...
متن کاملFinite-Trace Linear Temporal Logic: Coinductive Completeness
Linear temporal logic (LTL) is suitable not only for infinite-trace systems, but also for finite-trace systems. Indeed, LTL is frequently used as a trace specification formalism in runtime verification. The completeness of LTL with only infinite or with both infinite and finite traces has been extensively studied, but similar direct results for LTL with only finite traces are missing. This pape...
متن کاملIntroduction to Np-completeness
We use time-bounded (deterministic and nondeterministic) Turing machines to study computational complexity of decision problems. In this model, a Turing machine has two different halting states, called the accepting state and the rejecting state, respectively. We say that a Turing machine M is bounded by time T if for any input x, M on x always halts in T (|x|) moves (steps). If M is determinis...
متن کاملNP Completeness , Part 2
Example 1 Undirected Hamiltonian Path (UHP) and Undirected Hamiltonian Circuit (UHC) are the same problems as the corresponding problems for directed graphs, but the new problems are for undirected graphs. Claim 2 Given a polynomial time algorithm for Undirected Hamiltonian Path (UHP) there is a polynomial time algorithm for Directed Hamiltonian Path. 1. A DHP builds the triple (H, p, q), where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1995
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)00061-7